Compressed Sensing with Incremental Sparse Measurements

نویسندگان

  • Xiaofu Wu
  • Zhen Yang
  • Lu Gan
چکیده

This paper proposes a verification-based decoding approach for reconstruction of a sparse signal with incremental sparse measurements. In its first step, the verification-based decoding algorithm is employed to reconstruct the signal with a fixed number of sparse measurements. Often, it may fail as the number of sparse measurements may be not enough, possibly due to an underestimate of the signal sparsity. However, we observe that even if this first recovery fails, many component samples of the sparse signal have been identified. Hence, it is natural to further employ incremental measurements tuned to the unidentified samples with known locations. This approach has been proven very efficiently by extensive simulations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Block-Wise random sampling approach: Compressed sensing problem

The focus of this paper is to consider the compressed sensing problem. It is stated that the compressed sensing theory, under certain conditions, helps relax the Nyquist sampling theory and takes smaller samples. One of the important tasks in this theory is to carefully design measurement matrix (sampling operator). Most existing methods in the literature attempt to optimize a randomly initiali...

متن کامل

Accelerating Magnetic Resonance Imaging through Compressed Sensing Theory in the Direction space-k

Magnetic Resonance Imaging (MRI) is a noninvasive imaging method widely used in medical diagnosis. Data in MRI are obtained line-by-line within the K-space, where there are usually a great number of such lines. For this reason, magnetic resonance imaging is slow. MRI can be accelerated through several methods such as parallel imaging and compressed sensing, where a fraction of the K-space lines...

متن کامل

Frames for compressed sensing using coherence

We give some new results on sparse signal recovery in the presence of noise, for weighted spaces. Traditionally, were used dictionaries that have the norm equal to 1, but, for random dictionaries this condition is rarely satised. Moreover, we give better estimations then the ones given recently by Cai, Wang and Xu.

متن کامل

On the Compressed Measurements over Finite Fields: Sparse or Dense Sampling

We consider compressed sampling over finite fields and investigate the number of compressed measurements needed for successful L0 recovery. Our results are obtained while the sparseness of the sensing matrices as well as the size of the finite fields are varied. One of interesting conclusions includes that unless the signal is “ultra” sparse, the sensing matrices do not have to be dense. Keywor...

متن کامل

Compressed Shattering

The central idea of compressed sensing is to exploit the fact that most signals of interest are sparse in some domain and use this to reduce the number of measurements to encode. However, if the sparsity of the input signal is not precisely known, but known to lie within a specified range, compressed sensing as such cannot exploit this fact and would need to use the same number of measurements ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1302.2420  شماره 

صفحات  -

تاریخ انتشار 2013